A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems

A weighted even factor algorithm

An even factor in a digraph, introduced by Cunningham and Geelen (2001), is a collection of vertex-disjoint dipaths and even dicycles, which generalizes a path-matching of Cunningham and Geelen (1997). In a restricted class of digraphs, called odd-cyclesymmetric, Pap (2005) presented a combinatorial algorithm to find a maximum even factor. For odd-cycle-symmetric weighted digraphs, which are od...

Eigenvalue Asymptotics of the Even-Dimensional Exterior Landau-Neumann Hamiltonian

Finite groups have even more centralizers

For a finite group $G$‎, ‎let $Cent(G)$ denote the set of centralizers of single elements of $G$‎. ‎In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent‎, ‎then $Gcong S_3‎, ‎D_{10}$ or $S_3times S_3$‎. ‎This result gives a partial and positive answer to a conjecture raised by A‎. ‎R‎. ‎Ashrafi [On finite groups with a given number of centralizers‎, ‎Algebra‎ ‎Collo...

Comparative genetics of the T-even bacteriophages.

A system of amber mutants has been developed for each of the T-even bacteriophages T2 and T6, to complement those already available in T4. In T2 these mutants identify 52 genes, of which 49 are homologous with T4 genes; in T6 they identify 45 genes, of which 42 have T4 homologs, and an additional one which is homologous to a T2 gene not yet identified in T4. In both T2 and T6, recombination bet...

Even Faster Algorithm for Set Splitting!

In the p-Set Splitting problem we are given a universe U , a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that there are at least k sets in F that have non-empty intersection with both B and W . In this paper we study p-Set Splitting from the view point of kernelization and parameterized algorithms. Given an instance (U,F , k)...